Modified Evolutionary Algorithm and Chaotic Search for Bilevel Programming Problems
نویسندگان
چکیده
منابع مشابه
An Evolutionary Algorithm with Local Search for Convex Quadratic Bilevel Programming Problems
We present an evolutionary algorithm based on a local search scheme for convex quadratic bilevel programming problems. At first, based on Karush-Kuhn-Tucher conditions, the follower’s problem is replaced by its linear complementarity systems, and the bases of the linear systems are encoded as individuals of populations. For each fixed individual l, we can obtain the follower’s optimal solution ...
متن کاملAn Evolutionary Algorithm Based on a New Decomposition Scheme for Nonlinear Bilevel Programming Problems
In this paper, we focus on a class of nonlinear bilevel programming problems where the follower’s objective is a function of the linear expression of all variables, and the follower’s constraint functions are convex with respect to the follower’s variables. First, based on the features of the follower’s problem, we give a new decomposition scheme by which the follower’s optimal solution can be ...
متن کاملAn Evolutionary Algorithm for Solving Bilevel Programming Problems Using Duality Conditions
Bilevel programming is characterized by two optimization problems located at different levels, in which the constraint region of the upper level problem is implicitly determined by the lower level problem. This paper is focused on a class of bilevel programmingwith a linear lower level problem and presents a new algorithm for solving this kind of problems by combining an evolutionary algorithm ...
متن کاملAn algorithm for solving a class of bilevel programming problems
We consider the bilevel programming problem with a special lower level. As a reformulation, we use the optimal value approach which will be the basis for an outer approximation. We establish an algorithm that sequentially improves the approximation in order to solve the bilevel programming problem. Convergence results for both local and global optima are presented.
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12050767